WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(15)
  "0" :: [] -(0)-> "A"(1)
  "0" :: [] -(0)-> "A"(12)
  "0" :: [] -(0)-> "A"(8)
  "Cons" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "Cons" :: ["A"(13) x "A"(13)] -(13)-> "A"(13)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(13)
  "S" :: ["A"(1)] -(1)-> "A"(1)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "comp_f_g" :: ["A"(3) x "A"(3)] -(3)-> "A"(3)
  "comp_f_g#1" :: ["A"(1) x "A"(3) x "A"(15)] -(3)-> "A"(0)
  "foldr#3" :: ["A"(13)] -(3)-> "A"(3)
  "foldr_f#3" :: ["A"(13) x "A"(15)] -(2)-> "A"(0)
  "id" :: [] -(0)-> "A"(3)
  "id" :: [] -(0)-> "A"(15)
  "main" :: ["A"(15)] -(12)-> "A"(0)
  "map#2" :: ["A"(15)] -(1)-> "A"(13)
  "plus_x" :: ["A"(1)] -(0)-> "A"(1)
  "plus_x" :: ["A"(13)] -(0)-> "A"(13)
  "plus_x#1" :: ["A"(1) x "A"(0)] -(1)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "comp_f_g" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "comp_f_g#1" :: ["A"_cf(0) x "A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "foldr#3" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "id" :: [] -(0)-> "A"_cf(0)
  "map#2" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "plus_x" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "plus_x#1" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)
  "\"comp_f_g\"_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1)
  "\"id\"_A" :: [] -(0)-> "A"(1)
  "\"plus_x\"_A" :: ["A"(0)] -(0)-> "A"(1)